Online Heat Balancing for Parallel Indexed Database On Shared Nothing System
نویسندگان
چکیده
Shared nothing systems offer a tremendous processing capacity. In such highly parallel systems the data are typically declustered across the system processing elements (PEs) to exploit the I/O bandwidth of the PEs. However, the access pattern is inherently dynamic, which in turn can lead to performance degradation as some PEs become hot spot (bottleneck). Therefore, reorganization for heat (load) balancing is essential and should be online. Our objective is to migrate the data from the hot PEs to the cold PEs with minimal cost of modifying the index structure of the system, so that the system is heat balancing and consequently higher performance could be achieved with minimal reorganization cost. In this paper, we propose an online heat balancing strategy for parallel indexed database on shared nothing system, in which the data migration process itself is based on the heat statistics generated by the access pattern that may be directed to the distributed index structure of the system. The proposed strategy captures the intuitive goal of distributing the given heat across the system PEs as evenly as possible and the result demonstrates that it is efficient in correcting any degradation in the system performance.
منابع مشابه
A Fast Convergence Technique for Online Heat-Balancing of Btree Indexed Database over Shared-Nothing Parallel Systems
In shared-nothing environments, data is typically declustered and indexed across the system processing elements (PEs) to achieve efficient processing. However access patterns are inherently dynamic and skewed, thus, data reorganization based on the data access history (heat) is essential and should be done online. While the data is being reorganized, indexes need to be modified too, therefore, ...
متن کاملThe Simulation Evaluation of Heat Balancing Strategies for Btree Index over Parallel Shared Nothing Machines
The Simulation Evaluation of Heat Balancing Strategies for Btree Index over Parallel Shared Nothing Machines Hisham Feelifl and Masaru Kitsuregawa Institute of Industrial Science, The University of Tokyo {hisham, kitsure} @tkl.iis.u-tokyo.ac.jp In shared nothing machines the data are typically declustered across the system processing elements (PEs) to exploit the I/O bandwidth of the PEs. Notwi...
متن کاملRING: A Strategy for Minimizing the Cost of Online Data Placement Reorganization for Btree Indexed Database over Shared-nothing Parallel Machines
In this paper, we propose a new strategy called RING that utilizes a ring configuration of the range partition strategy to achieve eficient online data placement reorganization in shared-nothing environments. In the event of reorganization, it has been observed that the range partition strategy in its well-known configuration, the linear configuration, can lead to two main drawbacks: high reorg...
متن کاملHeat Balancing for Btree Indexed Database over Ring Configured Shared Nothing Machines
In shared nothing machines, data are typically declustered and indexed across the system processing elements (PEs) to achieve efficient query and transaction execution. Since the access pattern is inherently dynamic, therefore, there is no one placement of relations that is optimal for the lifetime of the database system. Whenever data is moved across PEs, the indexes need to be modified too. C...
متن کاملAnalysis of Dynamic Load Balancing Strategies for Parallel Shared Nothing Database Systems
Parallel database systems have to support both inter-transaction as well as intra-transaction parallelism. Inter-transaction parallelism (multi-user mode) is required to achieve high throughput, in particular for OLTP transactions, and sufficient cost-effectiveness. Intra-transaction parallelism is a prerequisite for reducing the response time of complex and data-intensive transactions (queries...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1999